National Repository of Grey Literature 83 records found  1 - 10nextend  jump to record: Search took 0.01 seconds. 
Intelligent Control of Traffic Lights
Skoták, Miloš ; Samek, Jan (referee) ; Malačka, Ondřej (advisor)
In this thesis is analyzed Multi-Agent system for intelligent control of traffic lights. For the simulation of a real situation was implemented a simulator of a traffic situation written in Java language, which is based on a cellular automata. In Multi-Agent system can be found not only communication between the agent and environment, but also communication among agents. To implement the rules was used extended AgentSpeak language model based on BSD with Jason interpreter. Experiments were done on a real road section in the city Brno.
Simulation of Physical Phenomena Using Cellular Automata
Martinek, Dominik ; Smrčka, Aleš (referee) ; Peringer, Petr (advisor)
This master's thesis deals with modelling and simulation of physical phenomena by cellular automata. The basic methods which model physical phenomena is enumerated and descibed in this thesis. One of the important part of this thesis is a set of demonstration models. Each model is focused on one selected area of physical phenomena. All models are described by transtition rules and the procedure of derivation of these rules is also presented here. There rules were used in implemented models.  Another part of this thesis contains of a simulation application for these models. The real application had been implemented in accord with this design and it has been used to perform the simulation experiments with exemplary models. Results of the simulation experiments are discussed in conclusion of this thesis. One exemplary model had also been adapted for parallel processing. The performances on a computer with different count of working processors were measured and are also discussed in the conclusion of this thesis
New Cellular Automata Design Techniques
Baláž, Martin ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
The aim of this master thesis is to introduce a new technique for the design of cellular automata which will provide a better possibilities for the implementation and solving given problems in an environment of non-uniform automata. In this work, the theoretical foundations of cellular automata have been summarized and the possibilities of their design were examined using two evolutionary principles that have commonly been used - genetic algorithm and cellular programming. Two principally different issues were selected on which the possibilities and capabilities of these techniques were proven: the synchronization problem and the system of implementation of logic gates in an environment of cellular automata. Based on a review of the implementation properties and the initial results of usage of these methods a new design method for cellular automata was created - cellular evolution. The cellular evolution with its method of "prediction of the future state of surrounding cells" provides new possibilities in the design of cellular automata since it operates with structured genes which allow the gene to be active for a variety of cellular surroundings. In the conclusion of this work, all three methods were compared on two selected problems and their abilities were summarized in a detailed overview.
Cellular automata (Game of Life)
Tomaštík, Marek ; Minář, Petr (referee) ; Matoušek, Radomil (advisor)
In this bachelor´s thesis was written basic informations about cellular automata, it´s function and usage in simulation. Second part of this work is aimed on celular automata Game of life in Java platform.
Emergent Behavior of Cellular Automata
Říha, Michal ; Jaroš, Jiří (referee) ; Bidlo, Michal (advisor)
This work deals with the simulation of an emergent behavior in cellular automata. In particular, density task, synchronization task and chessboard generation problem are investigated. It uses evolutionary algorithm to solve this problem.
Structural Design Using Cellular Automata
Bezák, Jakub ; Vašíček, Zdeněk (referee) ; Bidlo, Michal (advisor)
The aim of this paper is to introduce the readers to the field of cellular automata, their design and their usage for structural design. Genetic algorithms are usually involved in designing complicated cellular automata, and because of that they are also briefly described here. For the purposes of this work sorting networks are considered as suitable structures to be designed using cellular automata, however, they are not a part of the automata but they are generated separately by modified rules of a local transition function.
Procedural Generation of Dungeon Type Structures
Šipoš, Marek ; Rychlý, Marek (referee) ; Bartík, Vladimír (advisor)
The main aim of this bachelor thesis was to design and develop a library for procedural generation of dungeons and web application for its practical use. The library offers a configuration interface, output generation according to this configuration and file support. The web application allows the visualization of the obtained input. The implementation was done in Java language.
Prediction of Secondary Structure of Proteins Using Cellular Automata
Brigant, Vladimír ; Drahošová, Michaela (referee) ; Bendl, Jaroslav (advisor)
This work describes a method of the secondary structure prediction of proteins based on cellular automaton (CA) model - CASSP. Optimal model and CA transition rule parameters are acquired by evolutionary algorithm. Prediction model uses only statistical characteristics of amino acids, so its prediction is fast. Achieved results was compared with results of other tools for this purpose. Prediction cooperation with a existing tool PSIPRED was also tested. It didn't succeed to beat this existing tool, but partial improvement was achieved in prediction of only alpha-helix secondary structure motif, what can be helful if we need the best prediction of alpha-helices. It was developed also a web interface of designed system.
Discrete Simulation of Programmable Systems
Mynář, Pavel ; Zuzaňák, Jiří (referee) ; Mlích, Jozef (advisor)
The subject of this thesis is the design and implementation of software library for discrete simulation of programmable units and their mutual communication and implementation of several illustrative examples based on it. The library is designed to be platform independent and as robust and simple to use as possible.
Mobile robot path planning by means of cellular automata
Gofroj, Patrik ; Šoustek, Petr (referee) ; Dvořák, Jiří (advisor)
This thesis describes certain ways of mobile robot path planning. The main concern of this thesis are cellular automata and their usage in this problem of searching of optimal path.

National Repository of Grey Literature : 83 records found   1 - 10nextend  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.